Classifier Optimization Via Graph Complexity Measures
نویسندگان
چکیده
This paper examines the use of minimal spanning trees as an alternative measure of classifier performance. The ability of this measure to capture classifier complexity is studied through the use of a gene expression dataset. The effect of distance metric on classifier performance is also detailed within.
منابع مشابه
A Semi-Supervised Learning Algorithm for Multi-Layered Perceptrons
We address the issue of learning multi-layered perceptrons (MLPs) in a discriminative, inductive, multiclass, parametric, and semi-supervised fashion. We introduce a novel objective function that, when optimized, simultaneously encourages 1) accuracy on the labeled points, 2) respect for an underlying graph-represented manifold on all points, 3) smoothness via an entropic regularizer of the cla...
متن کاملOn the Variance-Type Graph Irregularity Measures
Bell's degree-variance Var$!{}_{B}$ for a graph $G$, with the degree sequence ($d_1,d_2,cdots,d_n$) and size $m$, is defined as$Var!_{B} (G)=frac{1}{n} sum _{i=1}^{n}left[d_{i} -frac{2m}{n}right]^{2}$.In this paper, a new version of the irregularity measures of variance-type, denoted by $Var_q$, is introduced and discussed. Based on a comparative study, it is demonstrated that the n...
متن کاملCounting Homomorphisms via Hypergraph-Based Structural Restrictions
The way in which the graph structure of the constraints influences the computational complexity of counting constraint satisfaction problems (#CSPs) is well understood for constraints of bounded arity. The situation is less clear if there is no bound on the arities. Here we initiate the systematic study of these problems and identify new classes of polynomial time solvable instances based on dy...
متن کاملBoosted Optimization for Network Classification
In this paper we propose a new classification algorithm designed for application on complex networks motivated by algorithmic similarities between boosting learning and message passing. We consider a network classifier as a logistic regression where the variables define the nodes and the interaction effects define the edges. From this definition we represent the problem as a factor graph of loc...
متن کاملComplexity and approximation ratio of semitotal domination in graphs
A set $S subseteq V(G)$ is a semitotal dominating set of a graph $G$ if it is a dominating set of $G$ andevery vertex in $S$ is within distance 2 of another vertex of $S$. Thesemitotal domination number $gamma_{t2}(G)$ is the minimumcardinality of a semitotal dominating set of $G$.We show that the semitotal domination problem isAPX-complete for bounded-degree graphs, and the semitotal dominatio...
متن کامل